An Association Rule Miner with Semi-Autonomic Threshold Setting

نویسنده

  • José L. Balcázar
چکیده

Association rule mining is well-known to depend heavily on a support threshold parameter, and on one or more thresholds for intensity of implication; among these measures, confidence is most often used and, sometimes, related alternatives such as lift, leverage, improvement, or all-confidence are employed, either separately or jointly with confidence. We describe here an association mining system which requires the user to set a single parameter, of quite clear intuitive semantics, and then uses the given value to compute autonomously the corresponding thresholds for support, confidence, blocking factor (which is a slight reformulation of improvement) and confidence width (which is a complementary, recently introduced measure of novelty for association rules). We argue that the availability of one parameter is desirable; suggest a number of desiderata for the conceptual basis of such a parameter, and explain how our implementation meets them and is able to find meaningful association rules with lesser needs of domain intuition from the user.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study on Ant Colony Optimization with Association Rule

Ant miner is a data mining algorithm based on Ant Colony Optimization (ACO). Ant miner algorithms are mainly for discovery rule for optimization. Ant miner + algorithm uses MAX-MIN ant system for discover rules in the database. Soil classification deals with the systematic categorization of soils based on distinguished characteristics as well as criteria. The proposed model delivers to Ant mine...

متن کامل

An Ant Colony Algorithm for Classification Rule Discovery

This work proposes an algorithm for rule discovery called Ant-Miner (Ant Colony-based Data Miner). The goal of Ant-Miner is to extract classification rules from data. The algorithm is based on recent research on the behavior of real ant colonies as well as in some data mining concepts. We compare the performance of Ant-Miner with the performance of the well-known C4.5 algorithm on six public do...

متن کامل

Fast Algorithms for Mining Interesting Frequent Itemsets without Minimum Support

Real world datasets are sparse, dirty and contain hundreds of items. In such situations, discovering interesting rules (results) using traditional frequent itemset mining approach by specifying a user defined input support threshold is not appropriate. Since without any domain knowledge, setting support threshold small or large can output nothing or a large number of redundant uninteresting res...

متن کامل

FUZZY GRAVITATIONAL SEARCH ALGORITHM AN APPROACH FOR DATA MINING

The concept of intelligently controlling the search process of gravitational search algorithm (GSA) is introduced to develop a novel data mining technique. The proposed method is called fuzzy GSA miner (FGSA-miner). At first a fuzzy controller is designed for adaptively controlling the gravitational coefficient and the number of effective objects, as two important parameters which play major ro...

متن کامل

Mining classification rules with Reduced MEPAR-miner Algorithm

In this study, a new classification technique based on rough set theory and MEPAR-miner algorithm for association rule mining is introduced. Proposed method is called as ‘Reduced MEPAR-miner Algorithm’. In the method being improved rough sets are used in the preprocessing stage in order to reduce the dimensionality of the feature space and improved MEPAR-miner algorithms are then used to extrac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006